Statistical Aspects of the Quantum Supremacy Demonstration

نویسندگان

چکیده

In quantum computing, a demonstration of supremacy (or advantage) consists presenting task, possibly no practical value, whose computation is feasible on device, but cannot be performed by classical computers in any amount time. The notable claim presented Google’s team 2019 demonstrating the ability circuit to generate, albeit with considerable noise, bitstrings from distribution that considered hard simulate computers. Very recently, 2020, was group University Science and Technology China, using different technology generating distribution, sharing some statistical principles demonstration. Verifying generated data indeed claimed assessing circuit’s noise level its fidelity undertaking. objective this paper explain relations between computing aspects involved terms are accessible statisticians, computer scientists, mathematicians. Starting modeling analysis demonstration, which we explain, study various estimators fidelity, approaches testing distributions computer. We propose models, discuss their implications. A preliminary Google data, focusing mostly circuits 12 14 qubits given parts paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity-Theoretic Foundations of Quantum Supremacy Experiments

In the near future, there will likely be special-purpose quantum computers with 40-50 high-quality qubits. This paper lays general theoretical foundations for how to use such devices to demonstrate “quantum supremacy”: that is, a clear quantum speedup for some task, motivated by the goal of overturning the Extended Church-Turing Thesis as confidently as possible. First, we study the hardness of...

متن کامل

The Quantum Statistical Mechanical Theory of Transport Processes

A new derivation of the quantum Boltzmann transport equation for the Fermion system from the quantum time evolution equation for the wigner distribution function is presented. The method exhibits the origin of the time - irreversibility of the Boltzmann equation. In the present work, the spin dependent and indistinguishibility of particles are also considered.

متن کامل

Quantum Supremacy and the Complexity of Random Circuit Sampling

A critical milestone on the path to useful quantum computers is quantum supremacy – a demonstration of a quantum computation that is prohibitively hard for classical computers. A leading near-term candidate, put forth by the Google/UCSB team, is sampling from the probability distributions of randomly chosen quantum circuits, which we call Random Circuit Sampling (RCS). In this paper we study bo...

متن کامل

Characterizing Quantum Supremacy in Near-Term Devices

Sergio Boixo, Sergei V. Isakov, Vadim N. Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, 4 John M. Martinis, 6 and Hartmut Neven Google Inc., Venice, CA 90291, USA Google Inc., 8002 Zurich, Switzerland QuAIL, NASA Ames Research Center, Moffett Field, CA 94035, USA SGT Inc., 7701 Greenbelt Rd., Suite 400, Greenbelt, MD 20770 Google Inc., Santa Barbara, CA 93117, USA Department of Physics, Univ...

متن کامل

Achieving quantum supremacy with sparse and noisy commuting quantum computations

The class of commuting quantum circuits known as IQP (instantaneous quantum polynomialtime) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. Here we study the power of IQP circuits in the presence of physically motivated constraints. First, we show that there is a family of sparse IQP circuits that can be implemented on a square lattice of n ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistical Science

سال: 2022

ISSN: ['2168-8745', '0883-4237']

DOI: https://doi.org/10.1214/21-sts836